#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
int n, a[maxn], cnt[maxn], sum;
bool vis[maxn];
inline int read () {
	int x = 0, k = 1;
	char ch = getchar ();
	while (!isdigit (ch) && ch != '-') ch = getchar ();
	if (ch == '-') {
		k = -1;
		ch = getchar ();
	}
	while (isdigit (ch)) {
		x = x * 10 + ch - '0';
		ch = getchar ();
	}
	return x * k;
}
int main () {
	freopen ("duel.in", "r", stdin);
	freopen ("duel.out", "w", stdout);
	n = read ();
	for (int i = 1; i <= n; i++) a[i] = read (), cnt[a[i]]++;
	sort (a + 1, a + 1 + n);
	for (int i = 1; i <= n; i++) {
		if (vis[a[i]]) continue;
		vis[a[i]] = 1;
		sum -= min (cnt[a[i]], sum);
		sum += cnt[a[i]];
	}
	cout << sum << '\n';
	return 0;
}
